Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 464 results
Sort by: relevance publication year

On the weight of universal insertion grammars

JOURNAL ARTICLE published May 2008 in Theoretical Computer Science

Authors: Lila Kari | Petr Sosík

A variant of random context grammars: Semi-conditional grammars

JOURNAL ARTICLE published 1985 in Theoretical Computer Science

Authors: Gheorghe Pǎun

From object grammars to ECO systems

JOURNAL ARTICLE published February 2004 in Theoretical Computer Science

Authors: Enrica Duchi | Jean-Marc Fedou | Simone Rinaldi

Function-dependent teams in eco-grammar systems

JOURNAL ARTICLE published September 2003 in Theoretical Computer Science

Authors: Dietmar Wätjen

GRAMMARS AS THEORIES: THE CASE FOR AXIOMATIC GRAMMAR (PART I)

JOURNAL ARTICLE published 1974 in Theoretical Linguistics

Authors: HANS-HEINRICH LIEB

A Note on Outward and Inward Productions in the Categorical Graph-Grammar Approach and Δ-Grammars

JOURNAL ARTICLE published 1995 in Electronic Notes in Theoretical Computer Science

Authors: H.J. Schneider

Team behaviour in eco-grammar systems

JOURNAL ARTICLE published December 1998 in Theoretical Computer Science

Authors: Erzsébet Csuhaj-Varjú | Alica Kelemenová

GRAMMARS AS THEORIES: THE CASE FOR AXIOMATIC GRAMMAR (PART II)

JOURNAL ARTICLE published 1976 in Theoretical Linguistics

Authors: HANS-HEINRICH LIEB

Decidability problems in grammar systems

JOURNAL ARTICLE published February 1999 in Theoretical Computer Science

Authors: Valeria Mihalache

Position-restricted grammar forms and grammars

JOURNAL ARTICLE published 1982 in Theoretical Computer Science

Research funded by National Science Foundation (MCS 73-03380,MCS 77-02470,MCS 77-2232)

Authors: Meera Blattner | Seymour Ginsburg

Watson–Crick D0L systems: generative power and undecidable problems

JOURNAL ARTICLE published September 2003 in Theoretical Computer Science

Authors: Petr Sosík

Small (purely) catalytic P systems simulating register machines

JOURNAL ARTICLE published April 2016 in Theoretical Computer Science

Research funded by European Regional Development Fund (CZ.1.05/1.1.00/02.0070) | Silesian University (SGS/6/2014,SGS/24/2013)

Authors: Petr Sosík | Miroslav Langer

An ambiguity hierarchy of weighted context-free grammars

JOURNAL ARTICLE published September 2023 in Theoretical Computer Science

Research funded by Japan Society for the Promotion of Science (22H03568)

Authors: Yusuke Inoue | Kenji Hashimoto | Hiroyuki Seki

P systems with proteins on membranes characterize PSPACE

JOURNAL ARTICLE published June 2013 in Theoretical Computer Science

Authors: Petr Sosík | Andrei Păun | Alfonso Rodríguez-Patón

Some results about centralized PC grammar systems

JOURNAL ARTICLE published February 1999 in Theoretical Computer Science

Authors: Jean-Michel Autebert

Watson–Crick D0L systems: the power of one transition

JOURNAL ARTICLE published May 2003 in Theoretical Computer Science

Authors: Arto Salomaa | Petr Sosík

The component hierarchy of chain-free cooperating distributed regular tree grammars

JOURNAL ARTICLE published July 2001 in Theoretical Computer Science

Authors: G. Dányi | Z. Fülöp

Nonterminal complexity of programmed grammars

JOURNAL ARTICLE published March 2003 in Theoretical Computer Science

Authors: Henning Fernau

Computationally universal P systems without priorities: two catalysts are sufficient

JOURNAL ARTICLE published February 2005 in Theoretical Computer Science

Authors: Rudolf Freund | Lila Kari | Marion Oswald | Petr Sosík

On the computational completeness of context-free parallel communicating grammar systems

JOURNAL ARTICLE published February 1999 in Theoretical Computer Science

Authors: Erzsébet Csuhaj-Varjú | György Vaszil